Improving Theoretical Line Search Techniques of Practical Numerical Optimization
نویسندگان
چکیده
منابع مشابه
CHAOS EMBEDDED CHARGED SYSTEM SEARCH FOR PRACTICAL OPTIMIZATION PROBLEMS
Chaos is embedded to the he Charged System Search (CSS) to solve practical optimization problems. To improve the ability of global search, different chaotic maps are introduced and three chaotic-CSS methods are developed. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for practical civil optimization problems.
متن کاملANT COLONY SEARCH METHOD IN PRACTICAL STRUCTURAL OPTIMIZATION
This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with pr...
متن کاملthe study of practical and theoretical foundation of credit risk and its coverage
پس از بررسی هر کدام از فاکتورهای نوع صنعت, نوع ضمانت نامه, نرخ بهره , نرخ تورم, ریسک اعتباری کشورها, کارمزد, ریکاوری, gdp, پوشش و وثیقه بر ریسک اعتباری صندوق ضمانت صادرات ایران مشخص گردید که همه فاکتورها به استثنای ریسک اعتباری کشورها و کارمزد بقیه فاکتورها رابطه معناداری با ریسک اعتباری دارند در ضمن نرخ بهره , نرخ تورم, ریکاوری, و نوع صنعت و ریسک کشورها اثر عکس روی ریسک اعتباری داردو پوشش, وثی...
15 صفحه اولInformation-theoretical optimization techniques
Let (I, </) be a measurable space, referred to as the state space. The state space is discrete if I is countable and J consists of all subsets of I. By 77 we denote the set of countable decompositions of I in measurable sets, directed in the usual way by refinement. 770 denotes the subset of 17 consisting of finite decompositions. By a distribution we mean a probability measure on (/, J). The s...
متن کاملImproving Direct Search algorithms by multilevel optimization techniques
Direct Search algorithms are classical derivative-free methods for optimization. Though endowed with solid theoretical properties, they are not well suited for large-scale problems due to slow convergence and scaling issues. In this paper, we discuss how such limitations can be circumvented, on problems for which a hierarchy of objective functions is available, by using multilevel schemes which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1818/1/012140